Seeking Significant Oligomers via Set Partitions Expected Count

نویسنده

  • Stephen Sauchi Lee
چکیده

In order to determine significance of word counts of DNA sequences, it is of first importance to develop a baseline comparison so that the non-randomness of the observed word count can be measured. We developed a novel measure of oligomer expected count using the concept of set partitions. This expected count provides a baseline reference to reveal non-random DNA sequences. Non-randomness of oligomers is evaluated in terms of the amount of deviation from the derived expected count. As a consequence, the ratio of the observed count to the expected count will indicate the degree of underor over-representation of the oligomers. The usefulness of the method is demonstrated when applied to two human chromosomes and an artificially generated random chromosome. Underand over-represented oligomers are revealed in the human chromosomes but not in the random chromosome.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stirling number of the fourth kind and lucky partitions of a finite set

The concept of Lucky k-polynomials and in particular Lucky χ-polynomials was recently introduced. This paper introduces Stirling number of the fourth kind and Lucky partitions of a finite set in order to determine either the Lucky k- or Lucky χ-polynomial of a graph. The integer partitions influence Stirling partitions of the second kind.

متن کامل

k-Efficient partitions of graphs

A set $S = {u_1,u_2, ldots, u_t}$ of vertices of $G$ is an efficientdominating set if every vertex of $G$ is dominated exactly once by thevertices of $S$. Letting $U_i$ denote the set of vertices dominated by $u_i$%, we note that ${U_1, U_2, ldots U_t}$ is a partition of the vertex setof $G$ and that each $U_i$ contains the vertex $u_i$ and all the vertices atdistance~1 from it in $G$. In this ...

متن کامل

Non-Crossing Partitions in Binary, Ordered and Motzkin Trees

Non-Crossing Tree partitions are newer mathematical objects that have recent applications in genetics and mathematical biology. We explore several interesting connections between these partitions and the more commonly studied non-crossing set partitions. While non-crossing set partitions are counted by the Catalan numbers, we prove that non-crossing tree partitions in Binary trees are counted b...

متن کامل

Convexity, Non–Crossing Tree Partitions and Independent Sets in Phylogenetic Trees

Non –crossing set partitions are counted by the Catalan numbers and have been extensively studied in mathematics. We introduce the concept of a non-crossing tree partition and then use generating functions to count the number non-crossing tree partitions in Ordered and Binary Phylogenetic trees. In addition, we explore the connection between convexity, tree partitions and independent sets. Last...

متن کامل

Combinatorial Structures and Group Invariant Partitions1

If a group acts on a set, an action of the group is induced on the partitions of the set. A formula is developed for the number of partitions invariant under this action. The formula is extended to count combinatorial objects such as labeled rooted trees or permutations defined on the invariant partitions.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008